Geometric Constellation Shaping for Concatenated Two-Level Multi-Level Codes

نویسندگان

چکیده

This paper studies a learning approach to geometric shaping (GS) for concatenated two-level multi-level codes (MLC). Unlike standard bit-interleaved coded modulation (BICM), the proposed MLC protects only least reliable bits (LRBs) by an inner code, and thereby efficiently reduces complexity associated with soft-decision (SD) decoding compared BICM without performance degradation. We propose new loss function training constellation shape in MLC, leading maximization of achievable rate. More specifically, considering different coding structures most (MRBs) LRBs, combines two functions: union bound on bit error rate (BER) MRBs generalized mutual information (GMI) LRBs. demonstrate simulations wavelength division multiplexing (WDM) optical fiber systems that offers gain over conventional cross entropy-based function. Furthermore, it is demonstrated GS outperforms terms transmission distance, even significantly lower SD complexity.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-stage Decoding for Multi-level Block Modulation Codes

In this paper, we investigate various types of multi-stage decoding for multi-level block modulation codes, in which the decoding of a component code at each stage can be either soft-decision or hard-decision, maximum likelihood or bounded-distance. Error performance of codes is analyzed for a memoryless additive channel based on various types of multi-stage decoding, and upper bounds on the pr...

متن کامل

Two-Level Fingerprinting Codes: Non-Trivial Constructions

We extend the concept of two-level fingerprinting codes, introduced by Anthapadmanabhan and Barg (2009) in context of traceability (TA) codes [1], to other types of fingerprinting codes, namely identifiable parent property (IPP) codes, secure-frameproof (SFP) codes, and frameproof (FP) codes. We define and propose the first explicit non-trivial construction for two-level IPP, SFP and FP codes.

متن کامل

Coding at the sample level for data hiding: turbo and concatenated codes

The performance of data hiding techniques in still images may be greatly improved by means of coding. In previous approaches repetition coding was firstly used to obtain N identical Gaussian channels over which block and convolutional coding were used. But knowing that repetition coding can be improved we may turn our attention to coding forwardly at the sample level. Bounds for both hard and s...

متن کامل

Multi-level Coding and Multi-stage Decoding for Modulations with Hexagonal Constellation

M-ary Modulation and convolutional encoder are commonly employed in modern wireless systems; the modulation has rectangular constellation and square decision regions, and the encoder is binary based. However, we have demonstrated previously that modulations with hexagonal decision regions are more energy efficient transmission. And we have introduced a system which is compatible with binary dat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Lightwave Technology

سال: 2022

ISSN: ['0733-8724', '1558-2213']

DOI: https://doi.org/10.1109/jlt.2022.3179529